Invariance and efficiency of convex representations
نویسندگان
چکیده
We consider two notions for the representations of convex cones: G-representation and liftedG-representation. The former represents a convex cone as a slice of another; the latter allows in addition, the usage of auxiliary variables in the representation. We first study the basic properties of these representations. We show that some basic properties of convex cones are invariant under one notion of representation but not the other. In particular, we prove that lifted-G-representation is closed under duality when the representing cone is self-dual. We also prove that strict complementarity of a convex optimization problem in conic form is preserved under G-representations. Then we move to study efficiency measures for representations. We evaluate the representations of homogeneous convex cones based on the “smoothness” of the transformations mapping the central path of the representation to the central path of the represented optimization problem.
منابع مشابه
Effect of Relocation and Rotation on Radial Efficiency Scores for a Partially Negative Data Problem
Negative data handling has gained a remarkable importance in the literature of Data Envelopment Analysis (DEA) to address many real life problems. Various erstwhile applications, in this arena, referred relocation of the origin to a superior (RDM) or to an inferior (Translated Input Oriented BCC) neighboring point. In this paper, the conditions for Rotation Invariance of various Data Envelop...
متن کاملA novel radial super-efficiency DEA model handling negative data
Super-efficiency model in the presence of negative data is a relatively neglected issue in the DEA field. The existing super-efficiency models have some shortcomings in practice. In this paper, a novel VRS radial super-efficiency DEA model based on Directional Distance Function (DDF) is proposed to provide a complete ranking order of units (including efficient and inefficient ones). The propose...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملSimple and Weak ∆-invariant Polyhedral Sets for Discrete-time Singular Systems
In this paper, necessary and sufficient conditions for the positive invariance of convex polyhedra with respect to linear discrete-time singular systems subject to bounded additive disturbances are established. New notions of ∆-invariance under different assumptions on the initial conditions are defined. Specifically, the notions of simple and weak ∆invariance are considered. They can be seen a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 111 شماره
صفحات -
تاریخ انتشار 2008